skip to main content

Explore Research Products in the NSF-PAR

  • Home
  • Search Results
  • Page 1 of 3

Search for: All records

Creators/Authors contains: "Balogh, József"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; ( , SIAM Journal on Discrete Mathematics)
    Free, publicly-accessible full text available June 30, 2024
  2. ; ; ( , Random Structures & Algorithms)
    Full Text Available 
  3. ; ; ( , Journal of Graph Theory)
    Abstract

    In this note we examine the following random graph model: for an arbitrary graph , with quadratic many edges, construct a graph by randomly adding edges to and randomly coloring the edges of with colors. We show that for a large enough constant and , every pair of vertices in are joined by a rainbow path, that is, israinbow connected, with high probability. This confirms a conjecture of Anastos and Frieze, who proved the statement for and resolved the case when and is a function of .

     
    more » « less
  4. ; ; ( , Discrete Applied Mathematics)
    Full Text Available 
  5. ; ; ( , Journal of Combinatorial Theory, Series B)
    Full Text Available 
  6. ; ; ( , Computational Geometry)
    Full Text Available 
  7. ; ; ( , Linear Algebra and its Applications)
    Full Text Available 
  8. ; ; ( , Journal of Combinatorial Theory, Series B)
    Full Text Available 
  9. ; ; ( , Journal of the London Mathematical Society)
    Full Text Available 
  10. ; ; ; ( , European Journal of Combinatorics)
    Full Text Available